vertex removable cycles of graphs and digraphs
نویسندگان
چکیده
in this paper we defined the vertex removable cycle in respect of the following, if $f$ is a class of graphs(digraphs) satisfying certain property, $g in f $, the cycle $c$ in $g$ is called vertex removable if $g-v(c)in in f $. the vertex removable cycles of eulerian graphs are studied. we also characterize the edge removable cycles of regular graphs(digraphs).
منابع مشابه
Vertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کامل0n removable cycles in graphs and digraphs
in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...
متن کاملRemovable Cycles in Planar Graphs
All graphs considered are finite and loopless, but may contain multiple edges. By a simple graph we shall mean a graph without multiple edges. It follows easily from a result of Mader [4, Theorem 1] that if G is a ^-connected simple graph of minimum degree at least k+2, then G contains a cycle C such that G-E(C) is ^-connected. Stronger results exist for the special case of 2-connected simple g...
متن کاملDestroying longest cycles in graphs and digraphs
In 1978, C. Thomassen proved that in any graph one can destroy all the longest cycles by deleting at most one third of the vertices. We show that for graphs with circumference k ≤ 8 it suffices to remove at most 1/k of the vertices. The Petersen graph demonstrates that this result cannot be extended to include k = 9 but we show that in every graph with circumference nine we can destroy all 9-cy...
متن کاملConsistent Cycles in Graphs and Digraphs
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle ~ C of Γ is called G-consistent whenever there is an element of G whose restriction to ~ C is the 1-step rotation of ~ C. Consistent cycles in finite arc-transitive graphs were introduced by Conway in one of his public lectures. He observed that the number of G-orbits of G-consistent cycles of an ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
caspian journal of mathematical sciencesناشر: university of mazandaran
ISSN 1735-0611
دوره 3
شماره 1 2014
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023